Bottom up Fuzzy Parsers: Fuzzy Simple LR, Fuzzy Canonical LR and Fuzzy LALR Parsers for Parsing Natural language

LR Parsers For Natural Languages

MLR, an extended LR parser, is introduced, and its application to natural language parsing is discussed. An LR parser is a ~;hift-reduce parser which is doterministically guided by a parsing table. A parsing table can be obtained automatically from a context-free phrase structure grammar. LR parsers cannot manage antl)iguous grammars such as natural language grammars, because their I)arsing tab...

Fuzzy Arithmetic with Parametric LR Fuzzy Numbers

Validating LR(1) Parsers

An LR(1) parser is a finite-state automaton, equipped with a stack, which uses a combination of its current state and one lookahead symbol in order to determine which action to perform next. We present a validator which, when applied to a context-free grammar G and an automaton A, checks that A and G agree. Validating the parser provides the correctness guarantees required by verified compilers...

Approximate Solution of Fuzzy Matrix Equations with LR Fuzzy Numbers

AX B In the paper, a class of fuzzy matrix equations    B where A is an m × n crisp matrix and is an m × p arbitrary LR fuzzy numbers matrix, is investigated. We convert the fuzzy matrix equation into two crisp matrix equations. Then the fuzzy approximate solution of the fuzzy matrix equation is obtained by solving two crisp matrix equations. The existence condition of the strong LR fuzzy s...

Solving LR fuzzy linear matrix equation†

In this paper, the fuzzy matrix equation $Awidetilde{X}B=widetilde{C}$ in which $A,B$ are $n times n$crisp matrices respectively and $widetilde{C}$ is an $n times n$ arbitrary LR fuzzy numbers matrix, is investigated. A new numerical procedure for calculating the fuzzy solution is designed and a sufficient condition for the existence of strong fuzzy solution is derived. Some examples are ...